Interior point method

Results: 87



#Item
314164  IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 7, JULY 2012 Interior-Point Methods for Full-Information and Bandit Online Learning

4164 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 7, JULY 2012 Interior-Point Methods for Full-Information and Bandit Online Learning

Add to Reading List

Source URL: stat.wharton.upenn.edu

Language: English - Date: 2013-03-18 20:18:38
32Towards a simplex-like method for conic programming Kartik Krishnan Department of Computing and Software McMaster University

Towards a simplex-like method for conic programming Kartik Krishnan Department of Computing and Software McMaster University

Add to Reading List

Source URL: www4.ncsu.edu

Language: English - Date: 2005-08-12 10:02:31
33NONLINEAR AND DYNAMIC OPTIMIZATION From Theory to Practice IC-32: Winter Semester[removed]

NONLINEAR AND DYNAMIC OPTIMIZATION From Theory to Practice IC-32: Winter Semester[removed]

Add to Reading List

Source URL: infoscience.epfl.ch

Language: English - Date: 2011-07-09 03:35:23
34Feasibility and Infeasibility in Optimization: Algorithms and Computational Methods John W. Chinneck Springer International Series in Operations Research & Management Science, Vol[removed]Approximately 300 pages, hardcover

Feasibility and Infeasibility in Optimization: Algorithms and Computational Methods John W. Chinneck Springer International Series in Operations Research & Management Science, Vol[removed]Approximately 300 pages, hardcover

Add to Reading List

Source URL: www.sce.carleton.ca

Language: English - Date: 2007-10-24 10:47:39
35Sparse Representations of Image Gradient Orientations for Visual Recognition and Tracking Georgios Tzimiropoulos† Stefanos Zafeiriou† † Dept. of Computing, Imperial College London 180 Queen’s Gate, London SW7 2AZ

Sparse Representations of Image Gradient Orientations for Visual Recognition and Tracking Georgios Tzimiropoulos† Stefanos Zafeiriou† † Dept. of Computing, Imperial College London 180 Queen’s Gate, London SW7 2AZ

Add to Reading List

Source URL: ibug.doc.ic.ac.uk

Language: English - Date: 2011-11-16 09:07:03
36Noname manuscript No. (will be inserted by the editor) Improved Constraint Consensus Methods for Seeking Feasibility in Nonlinear Programs Laurence Smith · John Chinneck ·

Noname manuscript No. (will be inserted by the editor) Improved Constraint Consensus Methods for Seeking Feasibility in Nonlinear Programs Laurence Smith · John Chinneck ·

Add to Reading List

Source URL: www.sce.carleton.ca

Language: English - Date: 2012-02-27 14:04:21
37Interior Point Algorithms for Large-Scale Nonlinear Programming: Theory and Algorithmic Development ¨ Andreas Wachter IBM T.J. Watson Research Center

Interior Point Algorithms for Large-Scale Nonlinear Programming: Theory and Algorithmic Development ¨ Andreas Wachter IBM T.J. Watson Research Center

Add to Reading List

Source URL: www.fields.utoronto.ca

Language: English - Date: 2005-03-02 14:22:17
38Florian A. Potra:  Summary of Research[removed]The results of the research over the past 17 years are contained in 81 papers published in professional journals, and in 20 papers published in refereed proceedings. In

Florian A. Potra: Summary of Research[removed]The results of the research over the past 17 years are contained in 81 papers published in professional journals, and in 20 papers published in refereed proceedings. In

Add to Reading List

Source URL: www.math.umbc.edu

Language: English - Date: 2010-11-06 17:22:20
39CORRECTOR-PREDICTOR METHODS FOR SUFFICIENT LINEAR COMPLEMENTARITY PROBLEMS IN A WIDE NEIGHBORHOOD OF THE CENTRAL PATH XING LIU∗ AND FLORIAN A. POTRA†  Abbreviated title: Corrector-predictor methods for sufficient LCP

CORRECTOR-PREDICTOR METHODS FOR SUFFICIENT LINEAR COMPLEMENTARITY PROBLEMS IN A WIDE NEIGHBORHOOD OF THE CENTRAL PATH XING LIU∗ AND FLORIAN A. POTRA† Abbreviated title: Corrector-predictor methods for sufficient LCP

Add to Reading List

Source URL: www.math.umbc.edu

Language: English - Date: 2006-03-31 14:24:45
401  Zero Duality Gap in Optimal Power Flow Problem Javad Lavaei and Steven H. Low  Abstract—The optimal power flow (OPF) problem is nonconvex

1 Zero Duality Gap in Optimal Power Flow Problem Javad Lavaei and Steven H. Low Abstract—The optimal power flow (OPF) problem is nonconvex

Add to Reading List

Source URL: netlab.caltech.edu

Language: English - Date: 2012-04-01 15:15:52